Tham khảo Thuật_toán_dòng_dữ

Tham khảo Thuật_toán_dòng_dữ_liệu

Alon, Noga; Matias, Yossi; Szegedy, Mario (1999), “The space complexity of approximating the frequency moments”, Journal of Computer and System Sciences, 58 (1): 137–147, doi:10.1006/jcss.1997.1545, ISSN 0022-0000. Phiên bản đầu tiên được xuất bản là Alon, Noga; Matias, Yossi; Szegedy, Mario (1996), “The space complexity of approximating the frequency moments”, Proceedings of the 28th ACM Symposium on Theory of Computing (STOC 1996), tr. 20–29, doi:10.1145/237814.237823, ISBN 0-89791-785-5.
Babcock, Brian; Babu, Shivnath; Datar, Mayur; Motwani, Rajeev; Widom, Jennifer (2002), “Models and issues in data stream systems”, Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002) (PDF), tr. 1–16, doi:10.1145/543613.543615.
Chakrabarti, Amit; Cormode, Graham; McGregor, Andrew (2010), “A near-optimal algorithm for estimating the entropy of a stream”, ACM Transactions on Algorithms, 6 (3)
Charikar, Moses; Chen, Kevin; Farach-Colton, Martin (2004), “Finding frequent items in data streams”, Theor. Comput. Sci., 312 (1): 3–15
Cormode, Graham; Muthukrishnan, S. (2005), “An Improved Data Stream Summary: The Count-Min Sketch and its Applications”, J. Algorithms, 55 (1): 58–75
Flajolet, Philippe; Martin, G. Nigel (1985), “Probabilistic Counting Algorithms for Data Base Applications”, J. Comput. Syst. Sci., 31 (2): 182–209
Gilbert, A. C.; Kotidis, Y.; Muthukrishnan, S.; Strauss, M. J. (2001), “Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries” (PDF), Proceedings of the International Conference on Very Large Data Bases: 79–88.
Kane, Daniel M.; Nelson, Jelani; Woodruff, David P. (2010), An optimal algorithm for the distinct elements problem, PODS '10, Indianapolis, Indiana, USA: ACM, tr. 41–52, doi:http://doi.acm.org/10.1145/1807085.1807094 Kiểm tra giá trị |doi= (trợ giúp), ISBN 978-1-4503-0033-9 Đã bỏ qua tham số không rõ |booktitle= (trợ giúp); Đã bỏ qua tham số không rõ |numpages= (trợ giúp); Đã bỏ qua tham số không rõ |keywords= (trợ giúp); Đã bỏ qua tham số không rõ |address= (gợi ý |location=) (trợ giúp); Đã bỏ qua tham số không rõ |acmid= (trợ giúp)
Karp, R. M.; Papadimitriou, C. H.; Shenker, S. (2003), “A simple algorithm for finding frequent elements in streams and bags”, ACM Transactions on Database Systems, 28 (1): 51–55, doi:10.1145/762471.762473.
Lall, Ashwin; Sekar, Vyas; Ogihara, Mitsunori; Xu, Jun; Zhang, Hui (2006), “Data streaming algorithms for estimating entropy of network traffic”, Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems (ACM SIGMETRICS 2006) (PDF), doi:10.1145/1140277.1140295.
Munro, J. Ian; Paterson, Mike (1980), “Selection and Sorting with Limited Storage”, Theor. Comput. Sci., 12: 315–323.
Xu, Jun (Jim) (2007), A Tutorial on Network Data Streaming (PDF).

Liên quan

Thuật ngữ giải phẫu cử động Thuật toán Thuật ngữ anime và manga Thuật ngữ thiên văn học Thuật ngữ lý thuyết đồ thị Thuật chiêu hồn Thuật toán Dijkstra Thuật ngữ tin học Thuật toán Kruskal Thuật ngữ ngữ âm học

Tài liệu tham khảo

WikiPedia: Thuật_toán_dòng_dữ_liệu ftp://ftp.cs.rochester.edu/pub/papers/theory/05.tr... http://www.cs.mcgill.ca/~denis/notes09.pdf http://domino.research.ibm.com/comm/research_proje... http://www-01.ibm.com/software/data/infosphere/str... http://www.dagstuhl.de/de/program/calendar/semhp/?... http://www.cse.buffalo.edu/~atri/courses/data-stre... http://www.cs.dartmouth.edu/~ac/Teach/CS85-Fall09/ http://www.cc.gatech.edu/~jx/reprints/talks/sigm07... http://www.eecs.harvard.edu/~michaelm/postscripts/... http://groups.csail.mit.edu/cag/streamit/index.sht...